A Quasisymmetric Function Generalization of the Chromatic Symmetric Function
نویسندگان
چکیده
منابع مشابه
A Quasisymmetric Function Generalization of the Chromatic Symmetric Function
The chromatic symmetric function XG of a graph G was introduced by Stanley. In this paper we introduce a quasisymmetric generalization X G called the k-chromatic quasisymmetric function of G and show that it is positive in the fundamental basis for the quasisymmetric functions. Following the specialization of XG to χG(λ), the chromatic polynomial, we also define a generalization χ k G(λ) and sh...
متن کاملA Noncommutative Chromatic Symmetric Function
In [12], Stanley associated with a graph G a symmetric function XG which reduces to G’s chromatic polynomial XG(n) under a certain specialization of variables. He then proved various theorems generalizing results about XG(n), as well as new ones that cannot be interpreted on the level of the chromatic polynomial. Unfortunately, XG does not satisfy a Deletion-Contraction Law which makes it diffi...
متن کاملA Chromatic Symmetric Function in Noncommuting Variables
In [12], Stanley associated with a graph G a symmetric function XG which reduces to G’s chromatic polynomial XG(n) under a certain specialization of variables. He then proved various theorems generalizing results about XG(n), as well as new ones that cannot be interpreted on the level of the chromatic polynomial. Unfortunately, XG does not satisfy a Deletion-Contraction Law which makes it diffi...
متن کاملA Two Parameter Chromatic Symmetric Function
We introduce and develop a two-parameter chromatic symmetric function for a simple graph G over the field of rational functions in q and t , Q (q, t). We derive its expansion in terms of the monomial symmetric functions, mλ, and present various correlation properties which exist between the two-parameter chromatic symmetric function and its corresponding graph. Additionally, for the complete gr...
متن کاملOn the chromatic symmetric function of a tree
Stanley defined the chromatic symmetric function X(G) of a graph G as a sum of monomial symmetric functions corresponding to proper colorings of G, and asked whether a tree is determined up to isomorphism by its chromatic symmetric function. We approach Stanley’s question by asking what invariants of a tree T can be recovered from its chromatic symmetric function X(T ). We prove that the degree...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2011
ISSN: 1077-8926
DOI: 10.37236/518